A direct bijection for the Harer-Zagier formula

نویسندگان

  • Ian P. Goulden
  • A. Nica
چکیده

We give a combinatorial proof of Harer and Zagier’s formula for the disjoint cycle distribution of a long cycle multiplied by an involution with no fixed points, in the symmetric group on a set of even cardinality. The main result of this paper is a direct bijection of a set Bp,k , the enumeration of which is equivalent to the Harer–Zagier formula. The elements of Bp,k are of the form ( , ), where is a pairing on {1, . . . , 2p}, is a partition into k blocks of the same set, and a certain relation holds between and . (The set partitions that can appear in Bp,k are called “shift-symmetric”, for reasons that are explained in the paper.) The direct bijection for Bp,k identifies it with a set of objects of the form ( , t), where is a pairing on a 2(p− k + 1)-subset of {1, . . . , 2p} (a “partial pairing”), and t is an ordered tree with k vertices. If we specialize to the extreme case when p = k − 1, then is empty, and our bijection reduces to a well-known tree bijection. © 2005 Elsevier Inc. All rights reserved. MSC: Primary, 05A15; Secondary, 05C05

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

An Analogue of the Harer-zagier Formula for Unicellular Maps on General Surfaces

A unicellular map is the embedding of a connected graph in a surface in such a way that the complement of the graph is simply connected. In a famous article, Harer and Zagier established a formula for the generating function of unicellular maps counted according to the number of vertices and edges. The keystone of their approach is a counting formula for unicellular maps on orientable surfaces ...

متن کامل

A Bijection for Unicellular Partitioned Bicolored Maps

In the present paper we construct a bijection that relates a set CN,p,q of unicellular partitioned bicolored maps to a set of couples (t, σ) of ordered bicolored trees and partial permutations. This bijection allows us to derive an elegant formula for the enumeration of unicellular bicolored maps, an analogue of the well-known Harer-Zagier result for unicolored one-face maps. Résumé. Dans cet a...

متن کامل

A bijective proof of Jackson's formula for the number of factorizations of a cycle

Factorizations of the cyclic permutation (1 2 . . . N) into two permutations with respectively n and m cycles, or, equivalently, unicellular bicolored maps with N edges and n white and m black vertices, have been enumerated independantly by Jackson and Adrianov using evaluations of characters of the symmetric group. In this paper we present a bijection between unicellular partitioned bicolored ...

متن کامل

Another Proof of the Harer-Zagier Formula

For a regular 2n-gon there are (2n − 1)!! ways to match and glue the 2n sides. The Harer-Zagier bivariate generating function enumerates the gluings by n and the genus g of the attendant surface and leads to a recurrence equation for the counts of gluings with parameters n and g. This formula was originally obtained using multidimensional Gaussian integrals. Soon after, Jackson and later Zagier...

متن کامل

A bijection for covered maps, or a shortcut between Harer-Zagierʼs and Jacksonʼs formulas

We consider maps on orientable surfaces. A map is unicellular if it has a single face. A covered map is a map with a marked unicellular spanning submap. For a map of genus g, the unicellular submap can have any genus in {0, 1, . . . , g}. Our main result is a bijection between covered maps with n edges and genus g and pairs made of a plane tree with n edges and a unicellular bipartite map of ge...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:
  • J. Comb. Theory, Ser. A

دوره 111  شماره 

صفحات  -

تاریخ انتشار 2005